Minimization of Mean Tardiness in a Flexible Job Shop
نویسندگان
چکیده
منابع مشابه
Minimizing the total tardiness in a flexible job-shop
In this article, we consider the minimization of the total tardiness in a flexible job-shop. In our knowledge, this criterion is not previously studied for this type of shop configuration. The total tardiness criterion was mainly considered in the single machine problem (Chu [Chu92] and Souissi et al. [SKC04]). Few references studied this criterion in a job-shop configuration. The priority rule...
متن کاملTabu search for minimizing total tardiness in a job shop
This paper presents a tabu search approach to minimize total tardiness for the job shop scheduling problem. The method uses dispatching rules to obtain an initial solution and searches for new solutions in a neighborhood based on the critical paths of the jobs. Diversi"cation and intensi"cation strategies are suggested. For small problems the solutions' quality is evaluated against optimal solu...
متن کاملHybrid Job Shop and parallel machine scheduling problems: minimization of total tardiness criterion
Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...
متن کاملA Genetic Algorithm Approach for Minimization of Mean Flow Time in Job Shop Scheduling
All rights reserved by www.ijsrd.com 607 A Genetic Algorithm Approach for Minimization of Mean Flow Time in Job Shop Scheduling Sunil Singh Narendra Jaiswal Department of Mechanical Engineering Vindhya Institute of Technology and Science, Satna 485001, Madhya Pradesh, India Abstract— This dissertation is motivated by a scheduling problem that is commonly observed in today’s manufacturing world....
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation Modelling
سال: 2013
ISSN: 1726-4529
DOI: 10.2507/ijsimm12(3)5.242